From ATL Tableaux to Alternating Automata
نویسنده
چکیده
The logic called ATL (Alternating-time Temporal Logic) was introduced, in 1997, as a modal logic of agents. The first direct algorithm to test whether a given ATL-formula θ is satisfiable was provided by V. Goranko and G. van Drimmelen in 2006. Their algorithm is based on alternating infinite tree automata. In 2009, V. Goranko and D. Shkatov proposed a method to test satisfiability of a formula θ based on tableaux. In this work, we compare the two methods, and, building on this, we propose a new way of associating a specific kind of alternating automaton, the so called joker automaton, to a formula in order to test its satisfiability. The specificity of its construction is that it exploits the core of the tableau building procedure, and its interesting property is that the recognized language is the set of all models of θ, without any restricting hypothesis on the moves of agents.
منابع مشابه
Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL of the full Alternating time temporal logic ATL∗. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the sat...
متن کاملOptimal Tableaux Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-time Temoral Logic ATL+
متن کامل
Minimisation of ATL ^* Models
The aim of this work is to provide a general method to minimize the size (number of states) of a model M of an ATL∗ formula. Our approach is founded on the notion of alternating bisimulation: given a model M, it is transformed in a stepwise manner into a new model M’ minimal with respect to bisimulation. The method has been implemented and will be integrated to the prover TATL, that constructiv...
متن کاملDeciding ATL∗ Satisfiability by Tableaux Technical report
We propose a tableau-based decision procedure for the full Alternating-time Temporal Logic ATL∗. We extend our procedure for ATL in order to deal with nesting of temporal operators. As a side effect, we obtain a new and conceptually simple tableau method for CTL∗. The worst case complexity of our procedure is 2EXPTIME. Our method is human-readable and easily implementable. A web application and...
متن کاملComplete axiomatization and decidability of Alternating-time temporal logic
Alternating-timeTemporal Logic (ATL), introduced byAlur,Henzinger andKupferman, is a logical formalism for the specification and verification of open systems involving multiple autonomous players (agents, components). In particular, this logic allows for the explicit expression of coalition abilities in such systems, modelled as infinite transition games between the coalition and its complement...
متن کامل